Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Computers --- Ordinateurs --- Périodiques --- Tijdschriften --- #FHIW:CAT1 --- #TS:TCPW --- 681.3*I12 --- Algorithms: algebraic algorithms; nonalgebraic algorithms; analysis of algorithms (Algebraic manipulation; computing methodologies) --- 681.3*I12 Algorithms: algebraic algorithms; nonalgebraic algorithms; analysis of algorithms (Algebraic manipulation; computing methodologies)

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

REDUCE is one of the most widely available and simple to use computer algebra systems. It enables users to manipulate complex algebraic expressions and equations symbolically just as mathematicians and scientists do traditionally on paper, and its capabilities include differentiation and exact symbolic integration. This book provides a comprehensive introduction to REDUCE from starting to run it through to using some of the user-contributed REDUCE packages written for specific applications. The authors' aim is to enable all students using REDUCE for the first time to gain a familiarity with the full range of REDUCE commands while at the same time learning something of the internal workings of REDUCE. Throughout, numerous exercises are provided to illustrate themes covered in the text as well as to encourage "hands on" working with REDUCE. Both authors are expert users of REDUCE and the text is based on their many years of teaching the system to undergraduate and graduate students. As a result, all those coming to use REDUCE for the first time will find this an invaluable tutor and guide. For more advanced users, it covers a number of aspects not included in the REDUCE manual.

Algebra --- Data processing --- Congresses --- REDUCE --- Congresses. --- 512 --- -681.3*I12 --- Mathematics --- Mathematical analysis --- -Congresses --- Algorithms: algebraic algorithms; nonalgebraic algorithms; analysis of algorithms (Algebraic manipulation; computing methodologies) --- 681.3*I12 Algorithms: algebraic algorithms; nonalgebraic algorithms; analysis of algorithms (Algebraic manipulation; computing methodologies) --- 512 Algebra --- 681.3*I12 --- Data processing&delete& --- Algebra - Data processing - Congresses --- Informatique --- Algorithmes et programmes --- Computer algebra --- Colloque

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Computer algorithms --- Algorithmes --- #WSCH:AAS2 --- 681.3*F2 --- 681.3*I12 --- Algorithms --- Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- Algorithms: algebraic algorithms; nonalgebraic algorithms; analysis of algorithms (Algebraic manipulation; computing methodologies) --- Computer algorithms. --- 681.3*I12 Algorithms: algebraic algorithms; nonalgebraic algorithms; analysis of algorithms (Algebraic manipulation; computing methodologies) --- 681.3*F2 Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- Complexite

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This is the first-ever book on computational group theory. It provides extensive and up-to-date coverage of the fundamental algorithms for permutation groups with reference to aspects of combinatorial group theory, soluble groups, and p-groups where appropriate. The book begins with a constructive introduction to group theory and algorithms for computing with small groups, followed by a gradual discussion of the basic ideas of Sims for computing with very large permutation groups, and concludes with algorithms that use group homomorphisms, as in the computation of Sylowsubgroups. No background in group theory is assumed. The emphasis is on the details of the data structures and implementation which makes the algorithms effective when applied to realistic problems. The algorithms are developed hand-in-hand with the theoretical and practical justification.All algorithms are clearly described, examples are given, exercises reinforce understanding, and detailed bibliographical remarks explain the history and context of the work. Much of the later material on homomorphisms, Sylow subgroups, and soluble permutation groups is new.

Group theory --- Computer science --- Algorithmes --- Algorithms --- Algoritmen --- Permutatiegroepen --- Permutation [Groupes de ] --- Permutation groups --- Permutation groups. --- Algorithms. --- Groupes de permutations --- 681.3*I12 --- Substitution groups --- Algorism --- Algebra --- Arithmetic --- Algorithms: algebraic algorithms; nonalgebraic algorithms; analysis of algorithms (Algebraic manipulation; computing methodologies) --- Foundations --- 681.3*I12 Algorithms: algebraic algorithms; nonalgebraic algorithms; analysis of algorithms (Algebraic manipulation; computing methodologies) --- Information theory. --- Group theory. --- Computer software. --- Combinatorics. --- Theory of Computation. --- Group Theory and Generalizations. --- Discrete Mathematics. --- Symbolic and Algebraic Manipulation. --- Algorithm Analysis and Problem Complexity. --- Data processing. --- Combinatorics --- Mathematical analysis --- Software, Computer --- Computer systems --- Groups, Theory of --- Substitutions (Mathematics) --- Communication theory --- Communication --- Cybernetics

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

681.3*B --- 510.5 --- #TCPW:AGGR --- 681.3*F2 --- 681.3*I12 --- 681.3*I12 Algorithms: algebraic algorithms; nonalgebraic algorithms; analysis of algorithms (Algebraic manipulation; computing methodologies) --- Algorithms: algebraic algorithms; nonalgebraic algorithms; analysis of algorithms (Algebraic manipulation; computing methodologies) --- 510.5 Algorithms. Computable functions --- Algorithms. Computable functions --- 681.3*B Hardware --- Hardware --- 681.3*F2 Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- Analysis of algorithms and problem complexity--See also {681.3*B6}; {681.3*B7}; {681.3*F13} --- Computer science --- informatica --- programmatielogica --- algoritmen